range queries造句

• Yao showed that there exists an efficient solution for range queries that involve semigroup operators.
• For a range query q, BATON first locats its left bound, q . low.
• Then \ min ( A, i, j ) denotes the corresponding minimum range query.
• Applying this access strategy to B-tree indexes can also combine range queries on multiple columns.
• Eventually, a 1-dimensional range query will be performed and the correct points will be reported.
• Nearest neighbor search and range queries are important subclasses of similarity search, and a number of solutions exist.
• Moreover, because of the preservation of lexicographic ordering, range queries can be done efficiently and precisely on P-Grid.
• In addition to supporting exact-match queries ( as in hashing ), it is well-suited for range queries.
• K nearest neighbor query is computed by iteratively performing range queries with an incrementally enlarged search region until k answers are obtained.
• Large leaves are an advantage with large range queries but slow down point queries, which require accessing a small portion of the leaf.
• The trie-structure of P-Grid allows different range query strategies, processed serially or parallelly, trading off message overheads and query resolution latency.
• A solution to this " crucial part of the UB-tree range query " linear with the z-address bit length has been described later.
• For example, if only membership queries are required and no successor / predecessor / range queries are, then Bloom filters can be used to speed up queries.
• The solution implemented in Fractal Tree indexes is to have large leaves that can be fetched as a whole for fast range queries but are broken into smaller pieces call basement nodes which can be fetched individually.
• Instead of reporting all of the points stored in the subtrees of the search paths, perform a ( " d "  " 1 )-dimensional range query on the associated structure of each subtree.
• In each partition, the use of a space-filling curve means that a range query in the native, two-dimensional space becomes a set of range queries in the transformed, one-dimensional space.
• In each partition, the use of a space-filling curve means that a range query in the native, two-dimensional space becomes a set of range queries in the transformed, one-dimensional space.
• When the function of interest in a range query is a semigroup operator the notion of f ^ {-1 } is not always defined, therefore we can not use an analogous strategy to the previous section.
• Database indexes on one or more columns are typically sorted by value, which makes range queries operations ( like the above " find all records with salaries between 40, 000 and 50, 000 example ) very fast.
• A common special case of the latter are simultaneous range queries on two or more simple keys, such as " find all employee records with salary between 50, 000 and 100, 000 and hired between 1995 and 2007 ".